package Q17_18_Shortest_Supersequence; public class Range { private int start; private int end; public Range(int s, int e) { start = s; end = e; } public int length() { return end - start + 1; } public boolean shorterThan(Range other) { return length() < other.length(); } public int getStart() { return start; } public int getEnd() { return end; } }